A Dynamic Multi-ary Query Tree Protocol for Passive RFID Anti-collision

In this paper, a dynamic multi-ary query tree (DMQT) anti-collision protocol for Radio Frequency Identification (RFID) systems is proposed large scale passive RFID tag identification. The DMQT based on an iterative process between the reader and tags which identifies position of collision bits through map commands dynamically encodes them to optimize slots allocation commands. way, completely eliminates empty greatly reduces slots, in turn identification time energy costs. addition differently other known protocols, does not need estimate number tags, reducing implementation complexity eliminating uncertainty caused by estimation algorithm. A numerical analysis shows that has better performance than algorithms larger 300. Meanwhile, when 2000 identity (ID) length 128 bits, total 2.58 s average cost 1.2 mJ, are 16.9% 10.4% less those state-of-the-art algorithms, respectively. addition, extension ACK command also been presented deal with capture effect avoid missing